An Isolated Letter Recognizer for Proper Name Identification Over the Telephone
نویسندگان
چکیده
Spelled letter recognition over the telephone line is essential for applications that involve names or addresses. In this paper we discuss the implementation and present results of a speaker independent spelled letter recognizer, trained and tested on the European project SPEECHDAT corpus. The system was implemented using HTK V2.0 (Hidden Markov Model Toolkit) software development tool and the speech signal was modelled using Hidden Markov Models (HMM).
منابع مشابه
Spanish recognizer of continuously spelled names over the telephone
In this paper we present a hypothesis-verification approach for a Spanish Recognizer of continuously spelled names over the telephone. We give a detailed description of the spelling task for Spanish where the most confusable letter sets are described. We introduce a new HMM topology with contextual silences incorporated into the letter model to deal with pauses between letters, increasing the L...
متن کاملRobustness improvements in continuously spelled names over the telephone
A speaker-independent speech recognizer for continuously spelled names, implemented for a switchboard call-routing task, is analyzed for sources of error. Results indicate most errors are due to extraneous speech and end-point detection errors. Strategies are proposed for improving the robustness of recognition, including tolerance for speech with pauses, and a letter-spotting strategy to handl...
متن کاملApplication of isolated word recognition to a voice controlled repertory dialer system
In this paper we describe a speaker trained, voice controlled, repertory dialer system. The main elements of tile system include: 1. A real-time speech analyzer that detects the presence of speech on the input line, and analyzes the speech to give features appropriate for a word recognizer. 2. An isolated word recognizer that decides which of a set of words was spoken. 3. A voice response syste...
متن کاملImproved spelling recognition using a tree-based fast lexical match
This paper addresses the problem of selecting a name from a very large list using spelling recognition. In order to greatly reduce the computational resources required, we propose a tree-based lexical fast match scheme to select a short list of candidate names. Our system consists of a free letter recognizer, a fast matcher, and a rescoring stage. The letter recognizer uses n-grams to generate ...
متن کاملA Stock Information System over the Telephone Network
In this paper, we present a large vocabulary , speaker independent speech recognition sys-tem(KT-STOCK) and describe its performance over the telephone network. KT-STOCK is a stock information retrieval system with which we can obtain the current price of a stock by saying a stock name among 710 stock names listed on the Korea stock exchange. The system is an HMM(hidden Markov model)-based isol...
متن کامل